Ising-like models on arbitrary graphs: The Hadamard way

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ising-like models on arbitrary graphs: the Hadamard way.

We propose a generic framework to describe classical Ising-like models defined on arbitrary graphs. The energy spectrum is shown to be the Hadamard transform of a suitably defined sparse "coding" vector associated with the graph. We expect that the existence of a fast Hadamard transform algorithm (used, for instance, in image compression processes), together with the sparseness of the coding ve...

متن کامل

Ising models on locally tree-like graphs

We consider Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the ‘cavity’ prediction for the limiting free energy per spin is correct for any temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) ...

متن کامل

The weak limit of Ising models on locally tree-like graphs

We consider the Ising model with inverse temperature β and without external field on sequences of graphs Gn which converge locally to the k-regular tree. We show that for such graphs the Ising measure locally weak converges to the symmetric mixture of the Ising model with + boundary conditions and the − boundary conditions on the k-regular tree with inverse temperature β. In the case where the ...

متن کامل

On Hadamard Diagonalizable Graphs

Of interest here is a characterization of the undirected graphs G such that the Laplacian matrix associated with G can be diagonalized by some Hadamard matrix. Many interesting and fundamental properties are presented for such graphs along with a partial characterization of the cographs that have this property

متن کامل

Ising and Potts models on quenched random gravity graphs

We report on single-cluster Monte Carlo simulations of the Ising, 4-state Potts and 10-state Potts models on quenched ensembles of planar, tri-valent (Φ3) random graphs. We confirm that the firstorder phase transition of the 10-state Potts model on regular 2D lattices is softened by the quenched connectivity disorder represented by the random graphs and that the exponents of the Ising and 4stat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2015

ISSN: 1539-3755,1550-2376

DOI: 10.1103/physreve.91.012142